Algorithms for Finding Disjoint Paths in Mobile Networks
نویسندگان
چکیده
Disjoint paths are useful in mobile networks for fault tolerance, increasing bandwidth, and achieving better load balance. Communication over multiple disjoint paths is a less expensive alternative to flooding the network. We present a distributed algorithm for finding k disjoint paths, for any given k, between a source S and a destination T in mobile networks where the links have uniform weight. Our algorithm runs in O(kn) time using O(km) messages where n is the number of nodes and m is the number of links in the network, and k is the number of paths to be found. We also present a resilient version of this algorithm that may be suitable for networks whose topology changes frequently.
منابع مشابه
An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملFinding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and link-disjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heu...
متن کاملGraph Theory Algorithms for Mobile Ad hoc Networksh
Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for mobile ad hoc networks (MANETs). But, students and investigators who are new to this area often get perplexed in the complexity of these simulators and lose the focus in designing and analyzing the characteristics of the network and the protocol. Most of the time would be ...
متن کاملReducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault tolerance capability. By using nodedisjoint paths, it is expected that the end-to-end delay in each path should be independent of each other. However, because of natural properties of wireless media and medium access mechanis...
متن کامل